Cutting Planes from Wide Split Disjunctions
نویسندگان
چکیده
In this paper, we discuss an extension of split cuts that is based on widening the underlying disjunctions. That the formula for deriving intersection cuts based on splits can be adapted to this case has been known for a decade now. For the first time though, we present applications and computational results. We further discuss extensions of the existing theory with respect to cut strengthening procedures, and present some ideas on how to use the wider disjunctions also in branching.
منابع مشابه
Cutting planes from two-term disjunctions
We consider a polyhedron intersected by a two-term disjunction, and we characterize the polyhedron resulting from taking its closed convex hull. This generalizes an earlier result of Conforti, Wolsey and Zambelli on split disjunctions. We also recover as a special case the valid inequalities derived by Judice, Sherali, Ribeiro and Faustino for linear complementarity problems.
متن کاملCombining Lift-and-Project and Reduce-and-Split
Split cuts constitute a class of cutting planes that has been successfully employed by the majority of Branch-and-Cut solvers for Mixed Integer Linear Programs. Given a basis of the LP relaxation and a split disjunction, the corresponding split cut can be computed with a closed form expression. In this paper, we use the Lift-and-Project framework [10] to provide the basis, and the Reduce-andSpl...
متن کاملMonoidal Cut Strengthening and Generalized Mixed-Integer Rounding for Disjunctive Programs∗
This article investigates cutting planes for mixed-integer disjunctive programs. In the early 1980s, Balas and Jeroslow presented monoidal disjunctive cuts exploiting the integrality of variables. For disjunctions arising from binary variables, it is known that these cutting planes are essentially the same as Gomory mixed-integer and mixed-integer rounding cuts. In this article, we investigate ...
متن کاملBranching on Split Disjunctions
Branch-and-Cut is the most commonly used algorithm for solving Integer and Mixed-Integer Linear Programs. In order to reduce the number of nodes that have to be enumerated before optimality of a solution can be proven, branching on general disjunctions (i.e. split disjunctions involving more than one variable, as opposed to branching on simple disjunctions defined on one variable only) was show...
متن کاملFinite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs
In this paper, we give a finite disjunctive programming procedure to obtain the convex hull of general mixed-integer linear programs (MILP) with bounded integer variables. We propose a finitely convergent convex hull tree algorithm which constructs a linear program that has the same optimal solution as the associated MILP. In addition, we combine the standard notion of sequential cutting planes...
متن کامل